Kotlin Computational Geometry/io.github.cponfick.kompgeom.algorithms.closestpair

Package-level declarations

Types

class ClosestPairDivideAndConquer(input: Collection<Vec2>) : IClosestPair<Vec2>

Closest Pair algorithm using the Divide and Conquer approach.

class ClosestPairNaive<V : Vector<V>>(input: Collection<V>) : IClosestPair<V>

Closest Pair algorithm using the Divide and Conquer approach. This implementation sorts the points by x and y coordinates and recursively finds the closest pair.

IClosestPair

interface IClosestPair<V : Vector<V>> : IAlgorithm<Result<V>>

Interface for closest pair algorithms.

Result

class Result<V : Vector<V>>(val distance: Double, val result: Pair<V, V>)

Represents the result of the closest pair algorithm.